Almost Optimality of the Orthogonal Super Greedy Algorithm for μ-Coherent Dictionaries
نویسندگان
چکیده
We study the approximation capability of orthogonal super greedy algorithm (OSGA) with respect to μ-coherent dictionaries in Hilbert spaces. establish Lebesgue-type inequalities for OSGA, which show that OSGA provides an almost optimal on first [1/(18μs)] steps. Moreover, we improve asymptotic constant inequality OGA obtained by Livshitz E D.
منابع مشابه
Learning and approximation capability of orthogonal super greedy algorithm
We consider the approximation capability of orthogonal super greedy algorithms (OSGA) and its applications in supervised learning. OSGA is concerned with selecting more than one atoms in each iteration step, which, of course, greatly reduces the computational burden when compared with the conventional orthogonal greedy algorithm (OGA). We prove that even for function classes that are not the co...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThreshold Estimation via Group Orthogonal Greedy Algorithm
Disclaimer: This is a version of an unedited manuscript that has been accepted for publication. As a service to authors and researchers we are providing this version of the accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proof will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may...
متن کاملA Vectorial Kernel Orthogonal Greedy Algorithm
This work is concerned with derivation and analysis of a modified vectorial kernel orthogonal greedy algorithm (VKOGA) for approximation of nonlinear vectorial functions. The algorithm pursues simultaneous approximation of all vector components over a shared linear subspace of the underlying function Hilbert space in a greedy fashion [16, 37] and inherits the selection principle of the f /P-Gre...
متن کاملINTERDISCIPLINARY MATHEMATICS INSTITUTE 2010 : 01 Orthogonal super greedy algorithm and application in compressed sensing IMI
The general theory of greedy approximation is well developed. Much less is known about how specific features of a dictionary can be used for our advantage. In this paper we discuss incoherent dictionaries. We build a new greedy algorithm which is called the Orthogonal Super Greedy Algorithm (OSGA). OSGA is more efficient than a standard Orthogonal Greedy Algorithm (OGA). We show that the rates ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11050186